Coalitional Public Announcement Games
نویسندگان
چکیده
Dynamic epistemic logic (DEL) is a popular framework for studying interaction in multi-agent systems. DELs describe the actions available to the agents, and their epistemic preand post-conditions. By extending standard epistemic models with preferences over epistemic states, we can say something about rational behaviour as well, combining logic and game theory. In this paper we assume that preferences are represented by epistemic goal formulae, and actions are public announcements as described by public announcement logic. We are interested in analysing coalition formation and in particular coalitional stability in such settings. To this end, we describe how such epistemic goal models can be viewed as coalitional (cooperative) games, and study and characterise the resulting class of games and their solutions in different ways. We use a model of coalitional games under imperfect information that is more natural for many logical and computational settings than most existing models, and propose some related solution concepts extending the notion of the core under common knowledge.
منابع مشابه
Core Membership Computation for Succinct Representations of Coalitional Games
In this paper, I compare and contrast two formal results on the computational complexity of core membership determination in two compact representations of coalitional games. Conitzer and Sandholm [1] proposed the multi-issue representations of coalitional games. This representation attempts to decompose a coalitional games into a set of sub-games. Later, Ieong and Shoham [3] proposed the margi...
متن کاملWhat will they say? - Public Announcement Games
Dynamic epistemic logics describe the epistemic consequences of actions. Public announcement logic, in particular, describe the consequences of public announcements. As such, these logics are descriptive – they describe what agents can do. In this paper we discuss what rational agents will or should do. We consider situations where each agent has a goal, a typically epistemic formula he or she ...
متن کاملCoalitional Game Theory for Communication Networks: A Tutorial
Game theoretical techniques have recently become prevalent in many engineering applications, notably in communications. With the emergence of cooperation as a new communication paradigm, and the need for self-organizing, decentralized, and autonomic networks, it has become imperative to seek suitable game theoretical tools that allow to analyze and study the behavior and interactions of the nod...
متن کاملAlgorithms for Coalitional Games
Coalitional games are studied extensively in economics and computer science. They have recently shown to be a useful formalism and are applicable to a wide range of domains from electronic commerce to trade and negotiation systems. Key topics in coalitional games include both deciding the stability of given coalitions and calculating representative or all stable coalitions. However, typically t...
متن کاملOn coalitional semivalues
In this paper we propose a characterization of the coalitional value for transferable utility games (Owen, 1977), and we define and study coalitional semivalues, which are generalizations of semivalues (Dubey, Neyman and Weber, 1981).
متن کامل